Characterizing the Existence of Potential Functions in Weighted Congestion Games
نویسندگان
چکیده
منابع مشابه
Network topology and equilibrium existence in weighted network congestion games
Every finite noncooperative game can be presented as a weighted network congestion game, and also as a network congestion game with player-specific costs. In the first presentation, different players may contribute differently to congestion, and in the second, they are differently (negatively) affected by it. This paper shows that the topology of the underlying (undirected two-terminal) network...
متن کاملOn the Existence of Pure Strategy Nash Equilibria in Integer-Splittable Weighted Congestion Games
We study the existence of pure strategy Nash equilibria (PSNE) in integer–splittable weighted congestion games (ISWCGs), where agents can strategically assign different amounts of demand to different resources, but must distribute this demand in fixed-size parts. Such scenarios arise in a wide range of application domains, including job scheduling and network routing, where agents have to alloc...
متن کاملOn the Existence of Pure Nash Equilibria in Weighted Congestion Games
We study the existence of pure Nash equilibria in weighted congestion games. Let C denote a set of cost functions. We say that C is consistent if every weighted congestion game with cost functions in C possesses a pure Nash equilibrium. Our main contribution is a complete characterization of consistency of cost functions. Specifically, we prove that a nonempty set C of twice continuously differ...
متن کاملOptimal Cost-Sharing in Weighted Congestion Games
We identify how to share costs locally in weighted congestion games with polynomial cost functions to minimize the worst-case price of anarchy (POA). First, we prove that among all cost-sharing methods that guarantee the existence of pure Nash equilibria, the Shapley value minimizes the worst-case POA. Second, if the guaranteed existence condition is dropped, then the proportional cost-sharing ...
متن کاملCongestion Games, Player-Specific Congestion Games and Weighted Congestion Games for Radio Resource Management in Wireless Networks
The goal of this report is two-fold: Firstly, we present a short introduction on congestion games, a class of non-cooperative games that have received considerable attention by the research community during the last years. We discuss their properties and present their two most prominent extensions, namely weighted congestion games and player-specific congestion games. Secondly, we discuss appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2011
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-011-9315-x